path-factor相关论文
Let G = ( V, E) be a finite simple graph and Pn denote the path of order n. A spanning subgraph F is called a {P2, P3}-f......
设G是一个n阶图,n=∑ki1ni,其中,ni≥2(i=1,2,,k)是整数.我们利用度和给出图G中存在n1,n2,…,nk阶点不交路的充分条件.......